Reconstructing Contracts

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Verifying Resource Contracts using Code Contracts

In this paper we present an approach to check resource consumption contracts using an off-theshelf static analyzer. We propose a set of annotations to support resource usage specifications, in particular, dynamic memory consumption constraints. Since dynamic memory may be recycled by a memory manager, the consumption of this resource is not monotone. The specification language can express both ...

متن کامل

Psychological Contracts Book Section Psychological Contracts

LSE has developed LSE Research Online so that users may access research output of the School. Copyright © and Moral Rights for the papers on this site are retained by the individual authors and/or other copyright owners. Users may download and/or print one copy of any article(s) in LSE Research Online to facilitate their private study or for non-commercial research. You may not engage in furthe...

متن کامل

Reconstructing Events

When something happens today, anywhere in the world, it will probably be captured on camera. Very likely, it will be captured by many cameras. Increasingly, it will be captured from many perspectives—by security cameras, overhead cameras, mobile users, and social media, as Figure 1 illustrates. This shift toward constant, multiperspective imaging will have a profound influence on how we chronic...

متن کامل

Reconstructing Provenance

Provenance is an increasingly important aspect of data management that is often underestimated and neglected by practitioners. In our work, we target the problem of reconstructing provenance of files in a shared folder setting, assuming that only standard filesystem metadata are available. We propose a content-based approach that is able to reconstruct provenance automatically, leveraging sever...

متن کامل

Reconstructing sequences

We prove that every sequence of length n can be reconstructed from the multiset of all its subsequences of length k, provided k ≥ (1 + o(1)) √ n logn. This is a substantial improvement on previous bounds.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The University of Toronto Law Journal

سال: 1993

ISSN: 0042-0220

DOI: 10.2307/825900